The locally connected coclosure of a Grothendieck topos

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Every Grothendieck Topos Has a One-way Site

Lawvere has urged a project of characterizing petit toposes which have the character of generalized spaces and gros toposes which have the character of categories of spaces. Étendues and locally decidable toposes are seemingly petit and have a natural common generalization in sites with all idempotents identities. This note shows every Grothendieck topos has such a site. More, it defines slante...

متن کامل

Cocomplete toposes whose exact completions are toposes

Let E be a cocomplete topos. We show that if the exact completion of E is a topos then every indecomposable object in E is an atom. As a corollary we characterize the locally connected Grothendieck toposes whose exact completions are toposes. This result strengthens both the Lawvere–Schanuel characterization of Boolean presheaf toposes and Hofstra’s characterization of the locally connected Gro...

متن کامل

The Grothendieck-Katz Conjecture for certain locally symmetric varieties

Using Margulis’s results on lattices in semisimple Lie groups, we prove the GrothendieckKatz p-Curvature Conjecture for certain locally symmetric varieties, including the moduli space of abelian varieties Ag when g > 1.

متن کامل

Locally Connected Recursion Categories

A recursion category is locally connected if connected domains are jointly epimorphic. New proofs of the existence of non-complemented and recursively inseparable domains are given in a locally connected category. The use of local connectedness to produce categorical analogs of undecidable problems is new; the approach allows us to relax the hypotheses under which the results were originally pr...

متن کامل

Locally Connected Recurrent Networks

The fully connected recurrent network (FRN) using the on-line training method, Real Time Recurrent Learning (RTRL), is computationally expensive. It has a computational complexity of O(N 4) and storage complexity of O(N 3), where N is the number of non-input units. We have devised a locally connected recurrent model which has a much lower complexity in both computational time and storage space....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1999

ISSN: 0022-4049

DOI: 10.1016/s0022-4049(97)00168-0